package com.yeping;

import java.util.Scanner;

public class OppoTest {
    public static void main(String[] args) {
//        Scanner in = new Scanner(System.in);
//
//        long l1 = in.nextInt();
//        long r1 = in.nextInt();
//        long l2 = in.nextInt();
//        long r2 = in.nextInt();
//        //获取最大值和最小值，然后相减得个数
//        long min = (l1 + l2) / 2;
//        long max = (r1 + r2) / 2;
//        System.out.println(max - min + 1);
//

        Scanner in = new Scanner(System.in);

        //（sum1/3 + sum2/3） / 2 =>  (sum1 + sum2) / 6 => sum / 6
        int len = in.nextInt();
        int[] array1 = new int[len];
        int[] array2 = new int[len];
        for (int i = 0; i < len; i++){
            array1[i] = in.nextInt();
            array2[i] = in.nextInt();
        }
        for (int i = 0; i < len; i++){//第i组数据去除
            double sum = 0;
            double min1 = Integer.MAX_VALUE,min2 = Integer.MAX_VALUE;
            double max1 = Integer.MIN_VALUE,max2 = Integer.MIN_VALUE;
            for (int j = 0; j < len; j++){//j为第j组数据,
                //如果是i则去除
                if (j == i) continue;
                //否则完全加起来并且记录最大最小值
                double num1 = array1[j];
                double num2 = array2[j];

                sum = sum + num1 + num2;
                if (num1 < min1) min1 = num1;
                if (num1 > max1) max1 = num1;

                if (num2 < min2) min2 = num2;
                if (num2 > max2) max2 = num2;

            }
            System.out.println((sum - min1 - min2 - max1 - max2) / (len - 1) / 2);
        }
    }
}
